Efficient XML tree pattern query evaluation using a novel one-phase holistic twig join scheme
نویسندگان
چکیده
Purpose of this paper This paper aims to provide an efficient algorithm for XML twig query evaluation. Design/Methodology/Approach In this chapter, we propose a single-phase holistic twig pattern matching method based on the TwigStack algorithm. Our method applies a novel stack structure to preserve the holisticity of the twig matches. Twig matches rooted at elements that are currently in the root stack are output directly.
منابع مشابه
TRACK : A Novel XML Join Algorithm for Efficient Processing Twig Queries
In order to find all occurrences of a tree/twig pattern in an XML database, a number of holistic twig join algorithms have been proposed. However, most of these algorithms focus on identifying a larger query class or using a novel label scheme to reduce I/O operations, and ignore the deficiency of the root-to-leaf strategy. In this paper, we propose a novel twig join algorithm called Track, whi...
متن کاملEfficient Processing of Ordered XML Twig Pattern
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. Holistic twig join algorithm has showed its superiority over binary decompose based approach due to efficient reducing intermediate results. The existing holistic join algorithms, however, cannot deal with ordered twig queries. A straightforward approach that first match...
متن کاملTR A6/05 From Region Encoding To Extended Dewey: On Efficient Processing of XML Twig Pattern Matching
Finding all the occurrences of a twig pattern in an XML database is a core operation for efficient evaluation of XML queries. A number of algorithms have been proposed to process a twig query based on region encoding labeling scheme. While region encoding supports efficient determination of ancestor-descendant (or parent-child) relationship between two elements, we observe that the information ...
متن کاملTwigStackList-: A Holistic Twig Join Algorithm for Twig Query with Not-Predicates on XML Data
As business and enterprises generate and exchange XML data more often, there is an increasing need for searching and querying XML data. A lot of researches have been done to match XML twig queries. However, as far as we know, very little work has examined the efficient processing of XML twig queries with not-predicates. In this paper, we propose a novel holistic twig join algorithm, called Twig...
متن کاملQuickStack: A Fast Algorithm for XML Query Matching
With the increasing popularity of XML for data representation and exchange, much research has been done for providing an efficient way to evaluate twig patterns in an XML database. As a result, many holistic join algorithms have been developed, most of which are derivatives of the well-known TwigStack algorithm. However, these algorithms still apply a two phase processing scheme: first identify...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IJWIS
دوره 5 شماره
صفحات -
تاریخ انتشار 2009